Normal Forms for Knowledge Compilation
نویسندگان
چکیده
A class of formulas called factored negation normal form is introduced. They are closely related to BDDs, but there is a DPLL-like tableau procedure for computing them that operates in PSPACE.Ordered factored negation normal form provides a canonical representation for any boolean function. Reduction strategies are developed that provide a unique reduced factored negation normal form. These compilation techniques work well with negated form as input, and it is shown that any logical formula can be translated into negated form in linear time.
منابع مشابه
Duality in Knowledge Compilation Techniques
Several classes of propositional formulas have been used as target languages for knowledge compilation. Some are based primarily on c-paths (essentially, the clauses in disjunctive normal form); others are based primarily on dpaths. Such duality is not surprising in light of the duality fundamental to classical logic. There is also duality among target languages in terms of how they treat links...
متن کاملA Strongly Exponential Separation of DNNFs from CNF Formulas
Decomposable Negation Normal Forms (DNNFs) are a restricted form of Boolean circuits in negation normal form where the subcircuits leading into each AND gate are defined on disjoint sets of variables. We prove an unconditional exponential lower bound on the size of DNNFs for a class of CNF formulas built from expander graphs. This result settles several open problems in the area of knowledge co...
متن کاملRepresenting Boolean Functions with Propositional Directed Acyclic Graphs
Propositional directed acyclic graphs (PDAG) continue the line of research on knowledge compilation in the context of Negational Normal Forms (NNF) and Binary Decision Diagrams (BDD). This paper summarizes previous results and open problems concerning knowledge representation based on PDAG and its sub-languages. In addition, it gives a short introduction to some application areas.
متن کاملMulti-state Directed Acyclic Graphs
This paper continues the line of research on the representation and compilation of propositional knowledge bases with propositional directed acyclic graphs (PDAG), negation normal forms (NNF), and binary decision diagrams (BDD). The idea is to permit variables with more than two states and to explicitly represent them in their most natural way. The resulting representation languages are analyze...
متن کاملCompilation for Critically onstrained Knowledge
We show that many “critically constrained” Random 3SAT knowledge bases (KBs) can be compiled into disjunctive normal form easily by using a variant of the “Davis-Putnam” proof procedure. From these compiled KBs we can answer all queries about entailment of conjunctive normal formulas, also easily compared to a “bruteforce” approach to approximate knowledge compilation into unit clauses for the ...
متن کامل